Optimal Incentives in Core-Selecting Auctions

نویسنده

  • Robert Day
چکیده

Optimal Incentives in Core-Selecting Auctions Robert Day, School of Business, University of Connecticut Paul Milgrom, Dept of Economics, Stanford University August 25, 2010 Auctions that select core allocations with respect to reported values generate competitive levels of sales revenues at equilibrium and limit bidder incentives to use shills. Among core-selecting auctions, the ones that select bidder-optimal points in the core are efficient in minimizing the bidders’ incentives to misreport. Those auctions select the Vickrey outcome whenever that lies in the core and otherwise select points with higher than Vickrey revenues. Among core allocations, the points that minimize total seller revenue also minimize the sum of the gains that bidders can earn from unilateral deviations. Minimum-revenue core-selecting auctions have recently been planned or implemented for several high-stakes applications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incentives in Core-Selecting Auctions

Incentives in Core-Selecting Auctions Paul Milgrom October 18, 2006 A “core-selecting auction mechanism” is a direct mechanism for a multi-item allocation problem that selects a core allocation with respect to the bidders’ reported values and the auctioneer’s exogenously given preferences. For every profile of others’ reports, a bidder has a best reply that is a truncation report. For every “bi...

متن کامل

Core-selecting package auctions

Auctions that select core allocations with respect to reported values generate competitive levels of sales revenues at equilibrium and limit bidder incentives to use shills. Among core-selecting auctions, the ones that minimize seller revenues also maximize incentives for truthful reporting, produce the Vickrey outcome when that lies in the core and, in contrast to the Vickrey auction, and crea...

متن کامل

The Vickrey-Target Strategy and the Core in Ascending Combinatorial Auctions

This paper considers a general class of combinatorial auctions with ascending prices, which includes the Vickrey-Clarke-Groves mechanism and core-selecting auctions. We analyze incentives in ascending combinatorial auctions under complete and perfect information. We show that in every ascending auction, the “Vickrey-target strategy” constitutes a subgame perfect equilibrium with a restricted st...

متن کامل

Core-pricing in large multi-object auctions: a market design for selling TV-ads

We introduce an auction design and computational methods to determine core payments for large markets with many objects such as the market for TV ads. Bidder optimal, core-selecting auctions have been introduced in spectrum auctions worldwide as a means to set incentives for truthful bidding, but at the same time avoid the problems of the Vickrey-Clarke-Groves mechanism. Many real-world markets...

متن کامل

Compact bid languages and core-pricing in large multi-object auctions

Combinatorial auctions address the fundamental problem of allocating multiple items in the presence of complex bidder preferences including complements or substitutes. They have found application in public and private sector auctions. Many real-world markets involve the sale of a large number of items, limiting the direct application of combinatorial auctions due to both computational intractab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010